Search results for "Small number"
showing 10 items of 15 documents
Exploring automatic grouping procedures in ceramic petrology
2004
Although a small number of studies have attempted to introduce automatic grouping procedures into thin section petrography of archaeological ceramics, the majority of studies continue to be carried out by non-automatic means. Although such an approach with the single observer grouping samples has a number of advantages, it is problematic when dealing with large numbers of samples. This paper aims to explore different coding systems and statistical analyses for grouping ceramic thin sections. In the example discussed a number of variables are defined, codified and analysed by correspondence analysis, classical multidimensional scaling, non-metric isotonic multidimensional scaling and Sammon …
A Comprehensive Spatiotemporal Framework for Hedonic Pricing: Integrating the Comparable Sales Approach and Minimizing Spatial Omitted Variable Bias
2019
This paper develops a theoretical and methodological framework that integrates Hedonic Pricing (HP), grid comparable sales approach (CSA), and nearest neighbors into a general spatiotemporal specification. By explicitly providing a theoretical justification for introducing spatial (or spatiotemporal) econometrics to HP, this approach is not only relevant to house price forecasting and automated valuation models (AVM) but also to valuing environmental goods capitalized in housing and to all other fields employing house pricing models. The resulting econometric CSA and spatiotemporal Durbin models provide higher prediction accuracy and reliability to alternatives by reducing the spatially-del…
Choosing Optimal Seed Nodes in Competitive Contagion.
2019
International audience; In recent years there has been a growing interest in simulating competitive markets to find out the efficient ways to advertise a product or spread an ideology. Along this line, we consider a binary competitive contagion process where two infections, A and B, interact with each other and diffuse simultaneously in a network. We investigate which is the best centrality measure to find out the seed nodes a company should adopt in the presence of rivals so that it can maximize its influence. These nodes can be used as the initial spreaders or advertisers by firms when two firms compete with each other. Each node is assigned a price tag to become an initial advertiser whi…
Learning Molecular Classes from Small Numbers of Positive Examples Using Graph Grammars
2021
We consider the following problem: A researcher identified a small number of molecules with a certain property of interest and now wants to find further molecules sharing this property in a database. This can be described as learning molecular classes from small numbers of positive examples. In this work, we propose a method that is based on learning a graph grammar for the molecular class. We consider the type of graph grammars proposed by Althaus et al. [2], as it can be easily interpreted and allows relatively efficient queries. We identify rules that are frequently encountered in the positive examples and use these to construct a graph grammar. We then classify a molecule as being conta…
Simultaneous zonation and calibration of pipe network parameters
2003
A procedure for simultaneously zoning and calibrating pipe network parameters is proposed and applied to the determination of pipe resistance coefficients. The methodology is aimed at grouping the parameters of all the pipes into a small number of zone parameters, constrained to keep the difference between the computed and the measured water heads below a given tolerance. It is shown that, in the case of nonlooped networks, the methodology leads to a linear minimization problem where the objective function is a measure of the heterogeneity of the estimated parameters. In the case of looped networks an iterative procedure, where the linear problem is coupled with a nonlinear problem having a…
Extraction of Singlet States from Noninteracting High-Dimensional Spins
2008
We present a scheme for the extraction of singlet states of two remote particles of arbitrary quantum spin number. The goal is achieved through post-selection of the state of interaction mediators sent in succession. A small number of iterations is sufficient to make the scheme effective. We propose two suitable experimental setups where the protocol can be implemented.
Modern taurine cattle descended from small number of near-eastern founders.
2012
Archaeozoological and genetic data indicate that taurine cattle were first domesticated from local wild ox (aurochs) in the Near East some 10,500 years ago. However, while modern mitochondrial DNA (mtDNA) variation indicates early Holocene founding event(s), a lack of ancient DNA data from the region of origin, variation in mutation rate estimates, and limited application of appropriate inference methodologies have resulted in uncertainty on the number of animals first domesticated. A large number would be expected if cattle domestication was a technologically straightforward and unexacting region-wide phenomenon, while a smaller number would be consistent with a more complex and challengin…
Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization
2007
The algorithm described here, called OptQuest/NLP or OQNLP, is a heuristic designed to find global optima for pure and mixed integer nonlinear problems with many constraints and variables, where all problem functions are differentiable with respect to the continuous variables. It uses OptQuest, a commercial implementation of scatter search developed by OptTek Systems, Inc., to provide starting points for any gradient-based local solver for nonlinear programming (NLP) problems. This solver seeks a local solution from a subset of these points, holding discrete variables fixed. The procedure is motivated by our desire to combine the superior accuracy and feasibility-seeking behavior of gradie…
A Multistart Scatter Search Heuristic for Smooth NLP and MINLP Problems
2005
The algorithm described here, called OptQuest/NLP or OQNLP, is a heuristic designed to find global optima for pure and mixed integer nonlinear problems with many constraints and variables, where all problem functions are differentiable with respect to the continuous variables. It uses OptQuest, a commercial implementation of scatter search developed by OptTek Systems, Inc., to provide starting points for a gradient-based local NLP solver. This solver seeks a local solution from a subset of these points, holding discrete variables fixed. The procedure is motivated by our desire to combine the superior accuracy and feasibility-seeking behavior of gradient-based local NLP solvers with the glob…
Constrained Clusterwise Linear Regression
2005
In market segmentation, Conjoint Analysis is often used to estimate the importance of a product attributes at the level of each single customer, clustering, successively, the customers whose behavior can be considered similar. The preference model parameter estimation is made considering data (usually opinions) of a single customer at a time, but these data are usually very few as each customer is called to express his opinion about a small number of different products (in order to simplify his/her work). In the present paper a Constrained Clusterwise Linear Regression algorithm is presented, that allows simultaneously to estimate parameters and to cluster customers, using, for the estimati…